package demo2;
import java.util.Deque;
import java.util.LinkedList;
public class TextMyQueue {


        private Deque<Integer> s1;
        private Deque<Integer> s2;
        public TextMyQueue() {
            s1 = new LinkedList<>();
            s2 = new LinkedList<>();
        }

        public void push(int x) {
            s1.push(x);
        }

        public int pop() {
            if(empty()) {
                return -1;
            }
            if(s2.isEmpty()) {
                while(!s1.isEmpty()) {
                    s2.push(s1.pop());
                }
            }
            return s2.pop();
        }

        public int peek() {
            if(empty()) {
                return -1;
            }
            if(s2.isEmpty()) {
                while(!s1.isEmpty()) {
                    s2.push(s1.pop());
                }
            }
            return s2.peek();
        }

        public boolean empty() {
            return s1.isEmpty() && s2.isEmpty();
        }

}
